Minimal 1-saturating sets and complete caps in binary projective spaces
نویسندگان
چکیده
In binary projective spaces PG(v, 2), minimal 1-saturating sets, including sets with inner lines and complete caps, are considered. A number of constructions of the minimal 1-saturating sets are described. They give infinite families of sets with inner lines and complete caps in spaces with increasing dimension. Some constructions produce sets with an interesting symmetrical structure connected with inner lines, polygons, and orbits of stabilizer groups.As an example we note an 11-set in PG(4, 2) called “Pentagon with center”. The complete classification of minimal 1-saturating sets in small geometries is obtained by computer and is connected with the constructions described. © 2005 Elsevier Inc. All rights reserved.
منابع مشابه
1-Saturating Sets, Caps, and Doubling-Critical Sets in Binary Spaces
We show that, for a positive integer r, every minimal 1-saturating set in PG(r − 1, 2) of size at least 11 36 2 r + 3 either is a complete cap or can be obtained from a complete cap S by fixing some s ∈ S and replacing every point s′ ∈ S \ {s} by the third point on the line through s and s′. Since, conversely, every set obtained in this way is a minimal 1-saturating set, and the structure of la...
متن کاملConstructions of Small Complete Caps in Binary Projective Spaces
In the binary projective spaces PG(n,2) k-caps are called large if k > 2n−1 and small if k ≤ 2n−1. In this paper we propose new constructions producing infinite families of small binary complete caps.
متن کاملMultiple coverings of the farthest-off points and multiple saturating sets in projective spaces
For the kind of coverings codes called multiple coverings of the farthestoff points (MCF) we define μ-density as a characteristic of quality. A concept of multiple saturating sets ((ρ, μ)-saturating sets) in projective spaces PG(N, q) is introduced. A fundamental relationship of these sets with MCF codes is showed. Lower and upper bounds for the smallest possible cardinality of (1, μ)-saturatin...
متن کاملMinimal 1-saturating sets in PG(2, q), q≤16
Minimal 1-saturating sets in the projective plane PG(2, q) are considered. The classification of all the minimal 1-saturating sets in PG(2, q) for q ≤ 8, the classification of the smallest minimal 1-saturating sets in PG(2, q), 9 ≤ q ≤ 13 and the determination of the smallest size of minimal 1-saturating sets in PG(2, 16) are given. These results have been found using a computer-based exhaustiv...
متن کاملFurther results on multiple coverings of the farthest-off points
Multiple coverings of the farthest-off points ((R,μ)-MCF codes) and the corresponding (ρ, μ)-saturating sets in projective spaces PG(N, q) are considered. We propose some methods which allow us to obtain new small (1, μ)-saturating sets and short (2, μ)-MCF codes with μ-density either equal to 1 (optimal saturating sets and almost perfect MCF-codes) or close to 1 (roughly 1+1/cq, c ≥ 1). In par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 113 شماره
صفحات -
تاریخ انتشار 2006